منابع مشابه
Mapping Powerlists onto Hypercubes
The theory of powerlists was recently introduced by Jay Misra. It gives us the ability to specify and verify certain parallel algorithms and connection structures. The notation is similar to sequential functional programming languages (such as Miranda TM Tur86]) but with constructs for expressing balanced division of lists. In the rst part of this work we study how some known algorithms for the...
متن کاملHigher-Dimensional Algebra II: 2-Hilbert Spaces
A 2-Hilbert space is a category with structures and properties analogous to those of a Hilbert space. More precisely, we deene a 2-Hilbert space to be an abelian category enriched over Hilb with a-structure, conjugate-linear on the hom-sets, satisfying hf g; hi = hg; f hi = hf; hg i. We also deene monoidal, braided monoidal, and symmetric monoidal versions of 2-Hilbert spaces, which we call 2-H...
متن کاملMapping Chainable Continua onto Dendroids
We prove that every chainable continuum can be mapped into a dendroid such that all point-inverses consist of at most three points. In particular, it follows that there exists a finite-to-one map from a hereditarily indecomposable continuum (the pseudoarc) onto hereditarily decomposable continuum. This answers a question by J. Krasinkiewicz.
متن کاملPALLAS: Mapping Applications onto Manycore
Parallel programming using the current state-of-the-art in software engineering techniques is hard. Expertise in parallel programming is necessary to deliver good performance in applications; however, it is very common that domain experts lack the requisite expertise in parallel programming. In order to drive the computer science research toward effectively using the available parallel hardware...
متن کاملMapping Loops onto Reconfigurable Architectures
Recon gurable circuits and systems have evolved from application speci c accelerators to a general purpose computing paradigm. But the algorithmic techniques and software tools are also heavily based on the hardware paradigm from which they have evolved. Loop statements in traditional programs consist of regular, repetitive computations which are the most likely candidates for performance enhan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1972
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1972-12846-5